The Horseless Epic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Mind at AI: Horseless Carriage to Clock

whether the former is desirable or even possible as some do and just continue to call the latter biology, philosophy, or psychology, why bother with AI at all? Despite this route of dismissal, the vitality of uncovering the expressive facilities and limits of new models of computation continues and I contend that this is what AI research is really about.1 New models of computation are likely to...

متن کامل

the relation between history and epic in iranian national epic

as bothepic and history express some stories of the past, their existing similaritiesand dissimilarities and their relation have attracted the attention of scholars.these two kinds of stories have been so similar that previous experts could notdistinguish the historical events from epics. in shāhnāme, as an excellent samplewhich iranians consider as their pre-islamic history until the last qaja...

متن کامل

مطالعه نشاننده های cr-epic و فضاهای cr-epic مطلق

مطابق معمول حلقه توابع پیوسته حقیقی مقدار روی فضای تیخونوف x را با c(x) نمایش می دهیم. اگر برای هر نشاننده ی توپولوژیکf : x?y نگاشت القایی ?:c(y)?c(x) اپی مورفیس در کاتگوری حلقه های جابجایی باشد. آنگاه فضای xرا فضایی cr-epic مطلق می نامند.فضا های تقریبا فشرده و p-فضاهای لیندلوف از ساده ترین این نوع فضاها می باشند.

EPiC Series in Computing

We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2017. This year, three tools CORA, Flow* and Isabelle/HOL (in alphabetic order) participated. They are applied to solve the reacha...

متن کامل

EPiC Series in Computing

Although clausal propositional proofs are significantly smaller compared to resolution proofs, their size on disk is still too large for several applications. In this paper we present several methods to compress clausal proofs. These methods are based on a two phase approach. The first phase consists of a light-weight compression algorithm that can easily be added to satisfiability solvers that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Milton Quarterly

سال: 2009

ISSN: 0026-4326,1094-348X

DOI: 10.1111/j.1094-348x.2009.00207.x